منابع مشابه
Optimal Hyper-Minimization
Minimal deterministic finite automata (dfas) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n logn), where n is the number of states of the input dfa, by [Gawrychowski and Jeż: Hyper-minimisation made efficient. Proc. Mfcs, Lncs 5734, 2009] and [Holzer and Maletti: An n logn algorithm for hyper-minim...
متن کاملNotes on Hyper-minimization
These notes report on recent advances in the relatively new area of hyper-minimization. Several open questions that were raised in the pioneering article [Badr, Geffert, and Shipman. Hyper-minimizing minimized deterministic finite state automata. RAIRO Theor. Inf. Appl., 43(1):69–94, 2009] are addressed here and the solutions, which are mostly taken from the literature, are presented in a unifo...
متن کاملUnweighted and Weighted Hyper-Minimization
Hyper-minimization of deterministic nite automata (dfa) is a recently introduced state reduction technique that allows a nite change in the recognized language. A generalization of this lossy compression method to the weighted setting over semi elds is presented, which allows the recognized weighted language to di er for nitely many input strings. First, the structure of hyper-minimal determini...
متن کاملHyper-Minimization in O(n)
Two formal languages are f-equivalent if their symmetric difference L1 △ L2 is a finite set — that is, if they differ on only finitely many words. The study of f-equivalent languages, and particularly the DFAs that accept them, was recently introduced [1]. First, we restate the fundamental results in this new area of research. Second, our main result is a faster algorithm for the natural minimi...
متن کاملHeuristic Hyper-minimization of Finite State Lexicons
Flag diacritics, which are special multi-character symbols executed at runtime, enable optimising finite-state networks by combining identical sub-graphs of its transition graph. Traditionally, the feature has required linguists to devise the optimisations to the graph by hand alongside the morphological description. In this paper, we present a novel method for discovering flag positions in mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2011
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054111009094